On Integers Nonrepresentable by a Generalized Arithmetic Progression

نویسنده

  • Gretchen L. Matthews
چکیده

We consider those positive integers that are not representable as linear combinations of terms of a generalized arithmetic progression with nonnegative integer coefficients. To do this, we make use of the numerical semigroup generated by a generalized arithmetic progression. The number of integers nonrepresentable by such a numerical semigroup is determined as well as that of its dual. In addition, we find the number and the sum of those integers representable by the dual of the semigroup that are not representable by the semigroup itself.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On rainbow 4-term arithmetic progressions

{sl Let $[n]={1,dots, n}$ be colored in $k$ colors. A rainbow AP$(k)$ in $[n]$ is a $k$ term arithmetic progression whose elements have different colors. Conlon, Jungi'{c} and Radoiv{c}i'{c} cite{conlon} prove that there exists an equinumerous 4-coloring of $[4n]$ which is rainbow AP(4) free, when $n$ is even. Based on their construction, we show that such a coloring of $[4n]$...

متن کامل

An Extreme Family of Generalized Frobenius Numbers

We study a generalization of the Frobenius problem: given k positive relatively prime integers, what is the largest integer g0 that cannot be represented as a nonnegative integral linear combination of the given integers? More generally, what is the largest integer gs that has exactly s such representations? We construct a family of integers, based on a recent paper by Tripathi, whose generaliz...

متن کامل

Antimagic valuations of generalized Petersen graphs

A connected graph G is said to be (a, d)-antimagic, for some positive integers a and d, if its edges admit a labeling by the integers 1,2, ... , IE( G) I such that the induced vertex labels consist of an arithmetic progression with the first term a and the common difference d. In this paper we prove that the generalized Petersen graph P(n,2) is (3n2+6, 3)-antimagic for n == 0 (mod 4), n ~ B.

متن کامل

On primes in arithmetic progression having a prescribed primitive root. II

Let a and f be coprime positive integers. Let g be an integer. Under the Generalized Riemann Hypothesis (GRH) it follows by a result of H.W. Lenstra that the set of primes p such that p ≡ a(mod f) and g is a primitive root modulo p has a natural density. In this note this density is explicitly evaluated with an Euler product as result.

متن کامل

Parity of the Partition Function in Arithmetic Progressions

Let p(n) denote the number of partitions of a non-negative integer n. A well-known conjecture asserts that every arithmetic progression contains infinitely many integers M for which p(M) is odd, as well as infinitely many integers N for which p(N) is even (see Subbarao [23]). In this paper we prove that there indeed are infinitely many integers N in every arithmetic progression for which p(N) i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004